Probably Intersecting Families are Not Nested
نویسندگان
چکیده
منابع مشابه
Probably Intersecting Families are Not Nested
It is well known that an intersecting family of subsets of an nelement set can contain at most 2n−1 sets. It is natural to wonder how ‘close’ to intersecting a family of size greater than 2n−1 can be. Katona, Katona and Katona introduced the idea of a ‘most probably intersecting family.’ Suppose that A is a family and that 0 < p < 1. Let A(p) be the (random) family formed by selecting each set ...
متن کاملCompressions and Probably Intersecting Families
A family A of sets is said to be intersecting if A ∩ B 6= ∅ for all A, B ∈ A. It is a well-known and simple fact that an intersecting family of subsets of [n] = {1, 2, . . . , n} can contain at most 2n−1 sets. Katona, Katona and Katona ask the following question. Suppose instead A ⊂ P[n] satisfies |A| = 2n−1 + i for some fixed i > 0. Create a new family Ap by choosing each member of A independe...
متن کاملMost Probably Intersecting Families of Subsets
Let F be a family of an n-element set. It is called intersecting if every pair of its members have a non-disjoint intersection. It is wellknown that an intersecting family satisfies the inequality |F| ≤ 2n−1. Suppose that |F| = 2n−1+i. Choose the members of F independently with probability p (delete them with probability 1−p). The new family is intersecting with a certain probability. We try to...
متن کاملMost Probably Intersecting Hypergraphs
The celebrated Erdős-Ko-Rado theorem shows that for n > 2k the largest intersecting k-uniform set family on [n] has size ( n−1 k−1 ) . It is natural to ask how far from intersecting larger set families must be. Katona, Katona and Katona introduced the notion of most probably intersecting families, which maximise the probability of random subfamilies being intersecting. We consider the most prob...
متن کاملIntersecting Families are Essentially Contained in Juntas
A family J of subsets of {1, . . . , n} is called a j-junta if there exists J ⊆ {1, . . . , n}, with |J | = j, such that the membership of a set S in J depends only on S ∩ J . In this paper we provide a simple description of intersecting families of sets. Let n and k be positive integers with k < n/2, and let A be a family of pairwise intersecting subsets of {1, . . . , n}, all of size k. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorics, Probability and Computing
سال: 2012
ISSN: 0963-5483,1469-2163
DOI: 10.1017/s0963548312000387